package dongtai;

public class liusan {
    public static int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int m=obstacleGrid.length;
        int n=obstacleGrid[0].length;
        int[][] dp=new int[m+1][n+1];
        dp[0][1]=1;
        for(int i=1;i<m+1;i++){
            for(int j=1;j<n+1;j++){
                if(obstacleGrid[i-1][j-1]==1){
                    dp[i][j]=0;
                }else{
                    dp[i][j]=dp[i-1][j]+dp[i][j-1];
                }
            }
        }
        return dp[m][n];

    }

    public static void main(String[] args) {
        int[][] obstacleGrid ={{0,0,0},{0,1,0},{0,0,0}};
        int i = uniquePathsWithObstacles(obstacleGrid);
        System.out.println(i);


    }
}
